Constraint-based knowledge representation for individualized instruction
نویسندگان
چکیده
منابع مشابه
Constraint-based knowledge representation for individualized instruction
Traditional knowledge representations were developed to encode complete, explicit and executable programs, a goal that makes them less than ideal for representing the incomplete and partial knowledge of a student. In this paper, we discuss state constraints, a type of knowledge unit originally invented to explain how people can detect and correct their own errors. Constraint-based student model...
متن کاملKR, constraint-based knowledge representation
KR is a very efficient knowledge representation language implemented in Common Lisp. It provides powerful frame-based knowledge representation with user-defined inheritance and relations, and an integrated object-oriented programming system. In addition, the system supports a constraint maintenance mechanism which allows any value to be computed from a combination of other values. KR is simple ...
متن کاملConstraint-based knowledge representation for configuration systems
Configuration is a design activity where the set of available components and their allowed combinations are known a priori. Configuration systems of today are typically rule-based systems. Maintenance and verification of rule-based system has shown to be extremely difficult because the knowledge relating to a single entity is spreading over several rules and modifications to rules must be check...
متن کاملConstraint Programming for Knowledge Representation
The paper describes a constraint programming method called Subdefinite Computations and a technique of implementing it in a CLP system ECLPS. One of practical applications of that implementation technique is Interval Domain library, a new constraint solving tool. The paper describes applications of the library to construction of optimum networks and optimum portfolios of assets.
متن کاملA Knowledge Representation for Constraint Satisfaction Problems
In this paper we present a general representation for constraint satisfaction problems (CSP) and a framework for reasoning about their solution that unlike most constraint-based relaxation algorithms. stresses the need for a "natural" encoding of constraint knowledge and can facilitate making inferences for propagation, backtracking, and explanation. The representation consists o i two componen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2006
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis0601001s